<!DOCTYPE html>
<html lang="zh-CN">
    <head>
	<meta name="generator" content="Hugo 0.86.0" />
        <meta charset="utf-8">
        <meta name="viewport" content="width=device-width, initial-scale=1">
        <meta name="robots" content="noodp" />
        <title>L_B__</title><meta name="referrer" content="no-referrer">
<meta name="description" content="专注记笔记"><meta property="og:title" content="L_B__" />
<meta property="og:description" content="专注记笔记" />
<meta property="og:type" content="website" />
<meta property="og:url" content="https://acking-you.github.io/" /><meta property="og:image" content="https://acking-you.github.io/logo.png"/>

<meta name="twitter:card" content="summary_large_image"/>
<meta name="twitter:image" content="https://acking-you.github.io/logo.png"/>

<meta name="twitter:title" content="L_B__"/>
<meta name="twitter:description" content="专注记笔记"/>
<meta name="application-name" content="FeelIt">
<meta name="apple-mobile-web-app-title" content="FeelIt"><meta name="theme-color" content="#ffffff"><meta name="msapplication-TileColor" content="#da532c"><link rel="canonical" href="https://acking-you.github.io/" /><link rel="alternate" href="/index.xml" type="application/rss+xml" title="L_B__">
    <link rel="feed" href="/index.xml" type="application/rss+xml" title="L_B__"><link rel="stylesheet" href="/css/home.min.css"><script type="application/ld+json">
    {
        "@context": "http://schema.org",
        "@type": "WebSite",
        "url": "https:\/\/acking-you.github.io\/","inLanguage": "zh-CN","description": "专注记笔记","name": "L_B__"
    }
    </script></head><body data-header-desktop="auto" data-header-mobile="auto"><script>(window.localStorage && localStorage.getItem('theme') ? localStorage.getItem('theme') === 'dark' : ('auto' === 'auto' ? window.matchMedia('(prefers-color-scheme: dark)').matches : 'auto' === 'dark')) && document.body.setAttribute('theme', 'dark');</script>

        <div id="mask"></div><div class="wrapper"><header class="desktop" id="header-desktop">
    <div class="header-wrapper">
        <div class="header-title">
            <a href="/" title="L_B__">L_B__</a>
        </div>
        <div class="menu">
            <div class="menu-inner"><a class="menu-item" href="/posts/"> 文章 </a><a class="menu-item" href="/tags/"> 标签 </a><a class="menu-item" href="/categories/"> 分类 </a><span class="menu-item delimiter"></span><span class="menu-item search" id="search-desktop">
                        <input type="text" placeholder="搜索文章标题或内容..." id="search-input-desktop">
                        <a href="#" class="search-button search-toggle" id="search-toggle-desktop" title="搜索">
                            <i class="fas fa-search fa-fw"></i>
                        </a>
                        <a href="#" class="search-button search-clear" id="search-clear-desktop" title="清空">
                            <i class="fas fa-times-circle fa-fw"></i>
                        </a>
                        <span class="search-button search-loading" id="search-loading-desktop">
                            <i class="fas fa-spinner fa-fw fa-spin"></i>
                        </span>
                    </span><a href="javascript:void(0);" class="menu-item theme-switch" title="切换主题">
                    <i class="fas fa-adjust fa-fw"></i>
                </a>
            </div>
        </div>
    </div>
</header><header class="mobile" id="header-mobile">
    <div class="header-container">
        <div class="header-wrapper">
            <div class="header-title">
                <a href="/" title="L_B__">L_B__</a>
            </div>
            <div class="menu-toggle" id="menu-toggle-mobile">
                <span></span><span></span><span></span>
            </div>
        </div>
        <div class="menu" id="menu-mobile"><div class="search-wrapper">
                    <div class="search mobile" id="search-mobile">
                        <input type="text" placeholder="搜索文章标题或内容..." id="search-input-mobile">
                        <a href="#" class="search-button search-toggle" id="search-toggle-mobile" title="搜索">
                            <i class="fas fa-search fa-fw"></i>
                        </a>
                        <a href="#" class="search-button search-clear" id="search-clear-mobile" title="清空">
                            <i class="fas fa-times-circle fa-fw"></i>
                        </a>
                        <span class="search-button search-loading" id="search-loading-mobile">
                            <i class="fas fa-spinner fa-fw fa-spin"></i>
                        </span>
                    </div>
                    <a href="#" class="search-cancel" id="search-cancel-mobile">
                        取消
                    </a>
                </div><a class="menu-item" href="/posts/" title="">文章</a><a class="menu-item" href="/tags/" title="">标签</a><a class="menu-item" href="/categories/" title="">分类</a><div class="menu-item"><a href="javascript:void(0);" class="theme-switch" title="切换主题">
                    <i class="fas fa-adjust fa-fw"></i>
                </a>
            </div></div>
    </div>
</header><div class="search-dropdown desktop">
    <div id="search-dropdown-desktop"></div>
</div>
<div class="search-dropdown mobile">
    <div id="search-dropdown-mobile"></div>
</div><main class="main">
                <div class="container"><div class="page home" data-home="posts"><div class="home-profile"><div class="home-avatar"><a href="/posts/" title="文章"><img
        class="lazyload"
        src="/svg/loading.min.svg"
        data-src="https://img-blog.csdnimg.cn/9fa00f1b7e4947588dc2e9788485129c.jpeg"
        data-srcset="https://img-blog.csdnimg.cn/9fa00f1b7e4947588dc2e9788485129c.jpeg, https://img-blog.csdnimg.cn/9fa00f1b7e4947588dc2e9788485129c.jpeg 1.5x, https://img-blog.csdnimg.cn/9fa00f1b7e4947588dc2e9788485129c.jpeg 2x"
        data-sizes="auto"
        alt="https://img-blog.csdnimg.cn/9fa00f1b7e4947588dc2e9788485129c.jpeg"
        title="https://img-blog.csdnimg.cn/9fa00f1b7e4947588dc2e9788485129c.jpeg" /></a></div><h1 class="home-title"><div style='color: rgb(153, 153, 153)'>学习如逆水行舟，不进则退！</div></h1><div class="home-subtitle"><div id="id-1" class="typeit"></div></div><div class="links"><a href="https://github.com/ACking-you" title="GitHub" target="_blank" rel="noopener noreffer me"><i class="fab fa-github-alt fa-fw"></i></a><a href="https://space.bilibili.com/24264499" title="bilibili" target="_blank" rel="noopener noreffer me"><i data-svg-src="/lib/simple-icons/icons/bilibili.min.svg"></i></a></div></div>
<div class="summary-card"><article class="summary" itemscope itemtype="http://schema.org/Article" ><div class="featured-image-preview">
            <a href="/posts/hugo%E5%8D%9A%E5%AE%A2%E5%9B%BE%E5%BD%A2%E5%8C%96%E5%86%99%E4%BD%9C%E5%B7%A5%E5%85%B7/"><img
        class="lazyload"
        src="/svg/loading.min.svg"
        data-src="https://img-blog.csdnimg.cn/img_convert/5bc78a387fa03b5039b9bca28aea1b14.png#pic_center"
        data-srcset="https://img-blog.csdnimg.cn/img_convert/5bc78a387fa03b5039b9bca28aea1b14.png#pic_center, https://img-blog.csdnimg.cn/img_convert/5bc78a387fa03b5039b9bca28aea1b14.png#pic_center 1.5x, https://img-blog.csdnimg.cn/img_convert/5bc78a387fa03b5039b9bca28aea1b14.png#pic_center 2x"
        data-sizes="auto"
        alt="https://img-blog.csdnimg.cn/img_convert/5bc78a387fa03b5039b9bca28aea1b14.png#pic_center"
        title="Hugo博客图形化写作工具" /></a>
        </div><h2 class="single-title" itemprop="name headline">
        <a href="/posts/hugo%E5%8D%9A%E5%AE%A2%E5%9B%BE%E5%BD%A2%E5%8C%96%E5%86%99%E4%BD%9C%E5%B7%A5%E5%85%B7/">Hugo博客图形化写作工具</a>
    </h2><div class="post-meta"><span class="post-author"><a href="/" title="Author" rel=" author" class="author"><i class="fas fa-user-circle fa-fw"></i>作者</a></span>&nbsp;<span class="post-publish">发布于 <time datetime="2022-02-12">2022-02-12</time></span>&nbsp;<span class="post-category">包括在 <a href="/categories/c++%E5%AE%9E%E6%88%98/"><i class="far fa-folder fa-fw"></i>C++实战</a></span></div><a class="content" href="/posts/hugo%E5%8D%9A%E5%AE%A2%E5%9B%BE%E5%BD%A2%E5%8C%96%E5%86%99%E4%BD%9C%E5%B7%A5%E5%85%B7/">软件使用 视频教程 项目介绍 项目所在地 温馨提示：如果本地还未搭建 hugo 博客，可以使用我的另一个 hugo 博客自动搭建工具 QtRun： 介绍：一个用纯 C++ 写的命令</a><div class="post-footer"><ul class="post-tags"><li><a href="/tags/hugo%E5%8D%9A%E5%AE%A2%E5%9B%BE%E5%BD%A2%E5%8C%96%E5%86%99%E4%BD%9C%E5%B7%A5%E5%85%B7/">Hugo博客图形化写作工具</a></li></ul></div>
</article>
<article class="summary" itemscope itemtype="http://schema.org/Article" ><div class="featured-image-preview">
            <a href="/posts/leetcode%E6%AF%8F%E6%97%A5%E4%B8%80%E9%A2%981020%E9%A3%9E%E5%9C%B0%E7%9A%84%E6%95%B0%E9%87%8F/"><img
        class="lazyload"
        src="/svg/loading.min.svg"
        data-src="https://img-blog.csdnimg.cn/img_convert/e5259f24f6a5a7fb2331d3fd0d18e631.png#pic_center"
        data-srcset="https://img-blog.csdnimg.cn/img_convert/e5259f24f6a5a7fb2331d3fd0d18e631.png#pic_center, https://img-blog.csdnimg.cn/img_convert/e5259f24f6a5a7fb2331d3fd0d18e631.png#pic_center 1.5x, https://img-blog.csdnimg.cn/img_convert/e5259f24f6a5a7fb2331d3fd0d18e631.png#pic_center 2x"
        data-sizes="auto"
        alt="https://img-blog.csdnimg.cn/img_convert/e5259f24f6a5a7fb2331d3fd0d18e631.png#pic_center"
        title="leetcode每日一题——1020飞地的数量" /></a>
        </div><h2 class="single-title" itemprop="name headline">
        <a href="/posts/leetcode%E6%AF%8F%E6%97%A5%E4%B8%80%E9%A2%981020%E9%A3%9E%E5%9C%B0%E7%9A%84%E6%95%B0%E9%87%8F/">并查集/dfs解决——leetcode每日一题——1020飞地的数量</a>
    </h2><div class="post-meta"><span class="post-author"><a href="/" title="Author" rel=" author" class="author"><i class="fas fa-user-circle fa-fw"></i>作者</a></span>&nbsp;<span class="post-publish">发布于 <time datetime="2022-02-12">2022-02-12</time></span>&nbsp;<span class="post-category">包括在 <a href="/categories/%E7%AE%97%E6%B3%95%E6%90%9C%E7%B4%A2%E7%B1%BB%E9%97%AE%E9%A2%98/"><i class="far fa-folder fa-fw"></i>算法——搜索类问题</a></span></div><a class="content" href="/posts/leetcode%E6%AF%8F%E6%97%A5%E4%B8%80%E9%A2%981020%E9%A3%9E%E5%9C%B0%E7%9A%84%E6%95%B0%E9%87%8F/">题目描述 题目链接 题目解析 一、以边界值为对象进行搜索解决 一开始很快就想到用比较暴力的直接dfs深搜，然后就超时了。 注意此题由于以 1 是否能延申到</a><div class="post-footer"><ul class="post-tags"><li><a href="/tags/leetcode%E6%AF%8F%E6%97%A5%E4%B8%80%E9%A2%981020%E9%A3%9E%E5%9C%B0%E7%9A%84%E6%95%B0%E9%87%8F/">leetcode每日一题——1020飞地的数量</a></li></ul></div>
</article>
<article class="summary" itemscope itemtype="http://schema.org/Article" ><div class="featured-image-preview">
            <a href="/posts/%E8%87%AA%E5%8A%A8%E5%8C%96%E6%90%AD%E5%BB%BA%E5%8D%9A%E5%AE%A2%E5%B7%A5%E5%85%B7/"><img
        class="lazyload"
        src="/svg/loading.min.svg"
        data-src="https://img-blog.csdnimg.cn/img_convert/cfdaf87ba57fa1099a94d87809378cbb.png#pic_center"
        data-srcset="https://img-blog.csdnimg.cn/img_convert/cfdaf87ba57fa1099a94d87809378cbb.png#pic_center, https://img-blog.csdnimg.cn/img_convert/cfdaf87ba57fa1099a94d87809378cbb.png#pic_center 1.5x, https://img-blog.csdnimg.cn/img_convert/cfdaf87ba57fa1099a94d87809378cbb.png#pic_center 2x"
        data-sizes="auto"
        alt="https://img-blog.csdnimg.cn/img_convert/cfdaf87ba57fa1099a94d87809378cbb.png#pic_center"
        title="自动化搭建博客工具" /></a>
        </div><h2 class="single-title" itemprop="name headline">
        <a href="/posts/%E8%87%AA%E5%8A%A8%E5%8C%96%E6%90%AD%E5%BB%BA%E5%8D%9A%E5%AE%A2%E5%B7%A5%E5%85%B7/">自动化搭建博客工具</a>
    </h2><div class="post-meta"><span class="post-author"><a href="/" title="Author" rel=" author" class="author"><i class="fas fa-user-circle fa-fw"></i>作者</a></span>&nbsp;<span class="post-publish">发布于 <time datetime="2022-02-12">2022-02-12</time></span>&nbsp;<span class="post-category">包括在 <a href="/categories/c++%E5%AE%9E%E6%88%98/"><i class="far fa-folder fa-fw"></i>C++实战</a></span></div><a class="content" href="/posts/%E8%87%AA%E5%8A%A8%E5%8C%96%E6%90%AD%E5%BB%BA%E5%8D%9A%E5%AE%A2%E5%B7%A5%E5%85%B7/">软件使用 使用前请下载好git工具 视频教程 项目介绍 项目所在地 温馨提示：本地搭建完网站框架后，每次新建文章的写作体验较差，可以看看我的另一个 hugo 博</a><div class="post-footer"><ul class="post-tags"><li><a href="/tags/%E8%87%AA%E5%8A%A8%E5%8C%96%E6%90%AD%E5%BB%BA%E5%8D%9A%E5%AE%A2%E5%B7%A5%E5%85%B7/">自动化搭建博客工具</a></li></ul></div>
</article>
<article class="summary" itemscope itemtype="http://schema.org/Article" ><div class="featured-image-preview">
            <a href="/posts/%E6%95%B0%E6%8D%AE%E5%BA%93%E5%9F%BA%E7%A1%80/"><img
        class="lazyload"
        src="/svg/loading.min.svg"
        data-src="https://img-blog.csdnimg.cn/img_convert/acea126d07748d6630f37b1b481e5d73.png#pic_center"
        data-srcset="https://img-blog.csdnimg.cn/img_convert/acea126d07748d6630f37b1b481e5d73.png#pic_center, https://img-blog.csdnimg.cn/img_convert/acea126d07748d6630f37b1b481e5d73.png#pic_center 1.5x, https://img-blog.csdnimg.cn/img_convert/acea126d07748d6630f37b1b481e5d73.png#pic_center 2x"
        data-sizes="auto"
        alt="https://img-blog.csdnimg.cn/img_convert/acea126d07748d6630f37b1b481e5d73.png#pic_center"
        title="数据库基础" /></a>
        </div><h2 class="single-title" itemprop="name headline">
        <a href="/posts/%E6%95%B0%E6%8D%AE%E5%BA%93%E5%9F%BA%E7%A1%80/">数据库基础</a>
    </h2><div class="post-meta"><span class="post-author"><a href="/" title="Author" rel=" author" class="author"><i class="fas fa-user-circle fa-fw"></i>作者</a></span>&nbsp;<span class="post-publish">发布于 <time datetime="2022-02-09">2022-02-09</time></span>&nbsp;<span class="post-category">包括在 <a href="/categories/javaweb%E7%AC%94%E8%AE%B0/"><i class="far fa-folder fa-fw"></i>JavaWeb笔记</a></span></div><a class="content" href="/posts/%E6%95%B0%E6%8D%AE%E5%BA%93%E5%9F%BA%E7%A1%80/">数据库基础 数据库是学习JavaWeb的一个前置，只有了解了数据库的操作和使用，我们才能更好地组织和管理网站应用产生的数据。 什么是数据库 数据库</a><div class="post-footer"><ul class="post-tags"><li><a href="/tags/%E6%95%B0%E6%8D%AE%E5%BA%93%E5%9F%BA%E7%A1%80/">数据库基础</a></li></ul></div>
</article>
<article class="summary" itemscope itemtype="http://schema.org/Article" ><div class="featured-image-preview">
            <a href="/posts/bellmanford%E5%92%8Cspfa%E7%AE%97%E6%B3%95%E8%AF%A6%E8%A7%A3/"><img
        class="lazyload"
        src="/svg/loading.min.svg"
        data-src="https://img-blog.csdnimg.cn/img_convert/6a656bf83ac631cc9afaeaef07661809.png"
        data-srcset="https://img-blog.csdnimg.cn/img_convert/6a656bf83ac631cc9afaeaef07661809.png, https://img-blog.csdnimg.cn/img_convert/6a656bf83ac631cc9afaeaef07661809.png 1.5x, https://img-blog.csdnimg.cn/img_convert/6a656bf83ac631cc9afaeaef07661809.png 2x"
        data-sizes="auto"
        alt="https://img-blog.csdnimg.cn/img_convert/6a656bf83ac631cc9afaeaef07661809.png"
        title="BellmanFord和SPFA算法详解" /></a>
        </div><h2 class="single-title" itemprop="name headline">
        <a href="/posts/bellmanford%E5%92%8Cspfa%E7%AE%97%E6%B3%95%E8%AF%A6%E8%A7%A3/">BellmanFord和SPFA算法详解</a>
    </h2><div class="post-meta"><span class="post-author"><a href="/" title="Author" rel=" author" class="author"><i class="fas fa-user-circle fa-fw"></i>作者</a></span>&nbsp;<span class="post-publish">发布于 <time datetime="2022-02-07">2022-02-07</time></span>&nbsp;<span class="post-category">包括在 <a href="/categories/%E7%AE%97%E6%B3%95%E6%9C%80%E7%9F%AD%E8%B7%AF%E9%97%AE%E9%A2%98/"><i class="far fa-folder fa-fw"></i>算法——最短路问题</a></span></div><a class="content" href="/posts/bellmanford%E5%92%8Cspfa%E7%AE%97%E6%B3%95%E8%AF%A6%E8%A7%A3/">*关于Bellman ford和SPFA算法的详解 我是白嫖的leetcode会员，然后看了关于图单源最短路径的讲解，讲解的非常好(虽然没代码演</a><div class="post-footer"><ul class="post-tags"><li><a href="/tags/bellmanford%E5%92%8Cspfa%E7%AE%97%E6%B3%95%E8%AF%A6%E8%A7%A3/">BellmanFord和SPFA算法详解</a></li></ul></div>
</article>
<article class="summary" itemscope itemtype="http://schema.org/Article" ><div class="featured-image-preview">
            <a href="/posts/dijkstra%E7%AE%97%E6%B3%95%E6%A8%A1%E6%9D%BF%E8%AE%B2%E8%A7%A3/"><img
        class="lazyload"
        src="/svg/loading.min.svg"
        data-src="https://img-blog.csdnimg.cn/img_convert/2729ae8b8d3a403affb81167fb3b1604.png#pic_center"
        data-srcset="https://img-blog.csdnimg.cn/img_convert/2729ae8b8d3a403affb81167fb3b1604.png#pic_center, https://img-blog.csdnimg.cn/img_convert/2729ae8b8d3a403affb81167fb3b1604.png#pic_center 1.5x, https://img-blog.csdnimg.cn/img_convert/2729ae8b8d3a403affb81167fb3b1604.png#pic_center 2x"
        data-sizes="auto"
        alt="https://img-blog.csdnimg.cn/img_convert/2729ae8b8d3a403affb81167fb3b1604.png#pic_center"
        title="Dijkstra算法模板讲解" /></a>
        </div><h2 class="single-title" itemprop="name headline">
        <a href="/posts/dijkstra%E7%AE%97%E6%B3%95%E6%A8%A1%E6%9D%BF%E8%AE%B2%E8%A7%A3/">Dijkstra算法模板讲解</a>
    </h2><div class="post-meta"><span class="post-author"><a href="/" title="Author" rel=" author" class="author"><i class="fas fa-user-circle fa-fw"></i>作者</a></span>&nbsp;<span class="post-publish">发布于 <time datetime="2022-02-07">2022-02-07</time></span>&nbsp;<span class="post-category">包括在 <a href="/categories/%E7%AE%97%E6%B3%95%E6%9C%80%E7%9F%AD%E8%B7%AF%E9%97%AE%E9%A2%98/"><i class="far fa-folder fa-fw"></i>算法——最短路问题</a></span></div><a class="content" href="/posts/dijkstra%E7%AE%97%E6%B3%95%E6%A8%A1%E6%9D%BF%E8%AE%B2%E8%A7%A3/">(也就5min)先点开链接把Dijkstra算法过程看一看(否则肯定看不懂代码). 视频详解Dijkstra算法过程 此方法最短路径的适用范围：</a><div class="post-footer"><ul class="post-tags"><li><a href="/tags/dijkstra%E7%AE%97%E6%B3%95%E6%A8%A1%E6%9D%BF%E8%AE%B2%E8%A7%A3/">Dijkstra算法模板讲解</a></li></ul></div>
</article>
<article class="summary" itemscope itemtype="http://schema.org/Article" ><div class="featured-image-preview">
            <a href="/posts/c&#43;&#43;%E5%9B%BE%E5%BD%A2%E5%8C%96%E5%AE%9E%E7%8E%B0%E5%AD%A6%E7%94%9F%E7%AE%A1%E7%90%86%E7%B3%BB%E7%BB%9F/"><img
        class="lazyload"
        src="/svg/loading.min.svg"
        data-src="https://img-blog.csdnimg.cn/img_convert/2319540b52ba53f88ff0afbf5cabb92c.png#pic_center"
        data-srcset="https://img-blog.csdnimg.cn/img_convert/2319540b52ba53f88ff0afbf5cabb92c.png#pic_center, https://img-blog.csdnimg.cn/img_convert/2319540b52ba53f88ff0afbf5cabb92c.png#pic_center 1.5x, https://img-blog.csdnimg.cn/img_convert/2319540b52ba53f88ff0afbf5cabb92c.png#pic_center 2x"
        data-sizes="auto"
        alt="https://img-blog.csdnimg.cn/img_convert/2319540b52ba53f88ff0afbf5cabb92c.png#pic_center"
        title="C&#43;&#43;图形化实现学生管理系统" /></a>
        </div><h2 class="single-title" itemprop="name headline">
        <a href="/posts/c&#43;&#43;%E5%9B%BE%E5%BD%A2%E5%8C%96%E5%AE%9E%E7%8E%B0%E5%AD%A6%E7%94%9F%E7%AE%A1%E7%90%86%E7%B3%BB%E7%BB%9F/">C&#43;&#43;图形化实现学生管理系统</a>
    </h2><div class="post-meta"><span class="post-author"><a href="/" title="Author" rel=" author" class="author"><i class="fas fa-user-circle fa-fw"></i>作者</a></span>&nbsp;<span class="post-publish">发布于 <time datetime="2022-02-05">2022-02-05</time></span>&nbsp;<span class="post-category">包括在 <a href="/categories/c++%E5%AE%9E%E6%88%98/"><i class="far fa-folder fa-fw"></i>C++实战</a></span></div><a class="content" href="/posts/c&#43;&#43;%E5%9B%BE%E5%BD%A2%E5%8C%96%E5%AE%9E%E7%8E%B0%E5%AD%A6%E7%94%9F%E7%AE%A1%E7%90%86%E7%B3%BB%E7%BB%9F/">Qt学生管理系统 想查看源码或者直接下载软件安装包可以到下面的链接： 软件安装包大概在这个位置 GitHub地址：链接 Gitee地址(方便国内访问</a><div class="post-footer"><ul class="post-tags"><li><a href="/tags/c&#43;&#43;%E5%9B%BE%E5%BD%A2%E5%8C%96%E5%AE%9E%E7%8E%B0%E5%AD%A6%E7%94%9F%E7%AE%A1%E7%90%86%E7%B3%BB%E7%BB%9F/">C&#43;&#43;图形化实现学生管理系统</a></li></ul></div>
</article>
<article class="summary" itemscope itemtype="http://schema.org/Article" ><div class="featured-image-preview">
            <a href="/posts/c&#43;&#43;%E5%8F%B3%E5%80%BC%E8%AF%AD%E4%B9%89%E7%9A%84%E5%9F%BA%E7%9F%B3%E5%AE%8C%E7%BE%8E%E8%BD%AC%E5%8F%91/"><img
        class="lazyload"
        src="/svg/loading.min.svg"
        data-src="https://img-blog.csdnimg.cn/img_convert/c644e86b92d93fcc4173c23ce127e625.png"
        data-srcset="https://img-blog.csdnimg.cn/img_convert/c644e86b92d93fcc4173c23ce127e625.png, https://img-blog.csdnimg.cn/img_convert/c644e86b92d93fcc4173c23ce127e625.png 1.5x, https://img-blog.csdnimg.cn/img_convert/c644e86b92d93fcc4173c23ce127e625.png 2x"
        data-sizes="auto"
        alt="https://img-blog.csdnimg.cn/img_convert/c644e86b92d93fcc4173c23ce127e625.png"
        title="C&#43;&#43;右值语义的基石——完美转发" /></a>
        </div><h2 class="single-title" itemprop="name headline">
        <a href="/posts/c&#43;&#43;%E5%8F%B3%E5%80%BC%E8%AF%AD%E4%B9%89%E7%9A%84%E5%9F%BA%E7%9F%B3%E5%AE%8C%E7%BE%8E%E8%BD%AC%E5%8F%91/">C&#43;&#43;右值语义的基石——完美转发</a>
    </h2><div class="post-meta"><span class="post-author"><a href="/" title="Author" rel=" author" class="author"><i class="fas fa-user-circle fa-fw"></i>作者</a></span>&nbsp;<span class="post-publish">发布于 <time datetime="2022-02-04">2022-02-04</time></span>&nbsp;<span class="post-category">包括在 <a href="/categories/%E7%8E%B0%E4%BB%A3c++%E8%AF%AD%E6%B3%95/"><i class="far fa-folder fa-fw"></i>现代C++语法</a></span></div><a class="content" href="/posts/c&#43;&#43;%E5%8F%B3%E5%80%BC%E8%AF%AD%E4%B9%89%E7%9A%84%E5%9F%BA%E7%9F%B3%E5%AE%8C%E7%BE%8E%E8%BD%AC%E5%8F%91/">什么是完美转发？ 熟悉现代C++语法的都应该清楚，C++把变量分为左值和右值，为了实现对资源的转移而不是拷贝，右值和对应的移动构造函数应运而生</a><div class="post-footer"><ul class="post-tags"><li><a href="/tags/c&#43;&#43;%E5%8F%B3%E5%80%BC%E8%AF%AD%E4%B9%89%E7%9A%84%E5%9F%BA%E7%9F%B3%E5%AE%8C%E7%BE%8E%E8%BD%AC%E5%8F%91/">C&#43;&#43;右值语义的基石——完美转发</a></li></ul></div>
</article>
<article class="summary" itemscope itemtype="http://schema.org/Article" ><div class="featured-image-preview">
            <a href="/posts/leetcode%E6%AF%8F%E6%97%A5%E4%B8%80%E9%A2%98%E5%92%8C%E4%B8%BAk%E7%9A%84%E6%9C%80%E5%B0%91%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%AD%97%E6%95%B0%E7%9B%AE/"><img
        class="lazyload"
        src="/svg/loading.min.svg"
        data-src="https://img-blog.csdnimg.cn/img_convert/526441b9fa37b831c54f8b76bf498cca.png#pic_center"
        data-srcset="https://img-blog.csdnimg.cn/img_convert/526441b9fa37b831c54f8b76bf498cca.png#pic_center, https://img-blog.csdnimg.cn/img_convert/526441b9fa37b831c54f8b76bf498cca.png#pic_center 1.5x, https://img-blog.csdnimg.cn/img_convert/526441b9fa37b831c54f8b76bf498cca.png#pic_center 2x"
        data-sizes="auto"
        alt="https://img-blog.csdnimg.cn/img_convert/526441b9fa37b831c54f8b76bf498cca.png#pic_center"
        title="leetcode每日一题——和为K的最少斐波那契数字数目" /></a>
        </div><h2 class="single-title" itemprop="name headline">
        <a href="/posts/leetcode%E6%AF%8F%E6%97%A5%E4%B8%80%E9%A2%98%E5%92%8C%E4%B8%BAk%E7%9A%84%E6%9C%80%E5%B0%91%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%AD%97%E6%95%B0%E7%9B%AE/">leetcode每日一题——和为K的最少斐波那契数字数目</a>
    </h2><div class="post-meta"><span class="post-author"><a href="/" title="Author" rel=" author" class="author"><i class="fas fa-user-circle fa-fw"></i>作者</a></span>&nbsp;<span class="post-publish">发布于 <time datetime="2022-02-03">2022-02-03</time></span>&nbsp;<span class="post-category">包括在 <a href="/categories/%E7%AE%97%E6%B3%95%E8%B4%AA%E5%BF%83/"><i class="far fa-folder fa-fw"></i>算法——贪心</a></span></div><a class="content" href="/posts/leetcode%E6%AF%8F%E6%97%A5%E4%B8%80%E9%A2%98%E5%92%8C%E4%B8%BAk%E7%9A%84%E6%9C%80%E5%B0%91%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%AD%97%E6%95%B0%E7%9B%AE/">题目 题目链接 题目详解 我开始是想着构造好fib数组的值，然后用背包问题去解决它。可惜，直接超时了！ 后面直接用最简单的贪心方式没想到真的可行。。</a><div class="post-footer"><ul class="post-tags"><li><a href="/tags/fib%E7%9A%84%E8%B4%AA%E5%BF%83%E5%8F%AF%E8%A1%8C%E6%80%A7/">fib的贪心可行性</a></li></ul></div>
</article>
<article class="summary" itemscope itemtype="http://schema.org/Article" ><div class="featured-image-preview">
            <a href="/posts/%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%B1%BB%E5%9E%8B%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E6%88%96%E9%80%92%E5%BD%92%E5%88%86%E6%B2%BB%E8%A7%A3%E8%A2%ABban%E5%AD%97%E7%AC%A6%E6%B1%82%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2/"><img
        class="lazyload"
        src="/svg/loading.min.svg"
        data-src="https://img-blog.csdnimg.cn/img_convert/30474f138a1fd099890cfcb17099a60b.png#pic_center"
        data-srcset="https://img-blog.csdnimg.cn/img_convert/30474f138a1fd099890cfcb17099a60b.png#pic_center, https://img-blog.csdnimg.cn/img_convert/30474f138a1fd099890cfcb17099a60b.png#pic_center 1.5x, https://img-blog.csdnimg.cn/img_convert/30474f138a1fd099890cfcb17099a60b.png#pic_center 2x"
        data-sizes="auto"
        alt="https://img-blog.csdnimg.cn/img_convert/30474f138a1fd099890cfcb17099a60b.png#pic_center"
        title="字符串类型滑动窗口或递归分治解被ban字符求最长子串" /></a>
        </div><h2 class="single-title" itemprop="name headline">
        <a href="/posts/%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%B1%BB%E5%9E%8B%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E6%88%96%E9%80%92%E5%BD%92%E5%88%86%E6%B2%BB%E8%A7%A3%E8%A2%ABban%E5%AD%97%E7%AC%A6%E6%B1%82%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2/">字符串类型滑动窗口或递归分治解被ban字符求最长子串</a>
    </h2><div class="post-meta"><span class="post-author"><a href="/" title="Author" rel=" author" class="author"><i class="fas fa-user-circle fa-fw"></i>作者</a></span>&nbsp;<span class="post-publish">发布于 <time datetime="2022-02-01">2022-02-01</time></span>&nbsp;<span class="post-category">包括在 <a href="/categories/%E7%AE%97%E6%B3%95%E5%AD%97%E7%AC%A6%E4%B8%B2/"><i class="far fa-folder fa-fw"></i>算法——字符串</a></span></div><a class="content" href="/posts/%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%B1%BB%E5%9E%8B%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E6%88%96%E9%80%92%E5%BD%92%E5%88%86%E6%B2%BB%E8%A7%A3%E8%A2%ABban%E5%AD%97%E7%AC%A6%E6%B1%82%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2/">题目一：至少有 K 个重复字符的最长子串 395. 至少有 K 个重复字符的最长子串 题目解析 有两种方法： 递归分治解决：该分治法的应用对象：解决那种不会去跨越任</a><div class="post-footer"><ul class="post-tags"><li><a href="/tags/%E9%80%92%E5%BD%92%E5%88%86%E6%B2%BB%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E4%BD%8D%E8%BF%90%E7%AE%97/">递归分治、滑动窗口、位运算</a></li></ul></div>
</article>
<article class="summary" itemscope itemtype="http://schema.org/Article" ><div class="featured-image-preview">
            <a href="/posts/%E5%88%92%E5%88%86%E6%95%B0%E9%97%AE%E9%A2%98/"><img
        class="lazyload"
        src="/svg/loading.min.svg"
        data-src="https://img-blog.csdnimg.cn/img_convert/18d027e6aa9fbe6cb650bbfce5b1ce53.png#pic_center"
        data-srcset="https://img-blog.csdnimg.cn/img_convert/18d027e6aa9fbe6cb650bbfce5b1ce53.png#pic_center, https://img-blog.csdnimg.cn/img_convert/18d027e6aa9fbe6cb650bbfce5b1ce53.png#pic_center 1.5x, https://img-blog.csdnimg.cn/img_convert/18d027e6aa9fbe6cb650bbfce5b1ce53.png#pic_center 2x"
        data-sizes="auto"
        alt="https://img-blog.csdnimg.cn/img_convert/18d027e6aa9fbe6cb650bbfce5b1ce53.png#pic_center"
        title="划分数问题" /></a>
        </div><h2 class="single-title" itemprop="name headline">
        <a href="/posts/%E5%88%92%E5%88%86%E6%95%B0%E9%97%AE%E9%A2%98/">划分数问题</a>
    </h2><div class="post-meta"><span class="post-author"><a href="/" title="Author" rel=" author" class="author"><i class="fas fa-user-circle fa-fw"></i>作者</a></span>&nbsp;<span class="post-publish">发布于 <time datetime="2022-01-30">2022-01-30</time></span>&nbsp;<span class="post-category">包括在 <a href="/categories/%E7%AE%97%E6%B3%95%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/"><i class="far fa-folder fa-fw"></i>算法——动态规划</a></span></div><a class="content" href="/posts/%E5%88%92%E5%88%86%E6%95%B0%E9%97%AE%E9%A2%98/">题目 题目链接 题目详解 划分数类型题目都是dp解决，而且都有固定的套路和公式，但我们还是需要在前人的公式上加以理解！ 划分数问题dp总结 我这里就提</a><div class="post-footer"><ul class="post-tags"><li><a href="/tags/%E5%88%92%E5%88%86%E6%95%B0%E9%97%AE%E9%A2%98/">划分数问题</a></li></ul></div>
</article>
<article class="summary" itemscope itemtype="http://schema.org/Article" ><div class="featured-image-preview">
            <a href="/posts/leetcode%E6%AF%8F%E6%97%A5%E4%B8%80%E9%A2%98%E5%9C%B0%E5%9B%BE%E4%B8%AD%E7%9A%84%E6%9C%80%E9%AB%98%E7%82%B9/"><img
        class="lazyload"
        src="/svg/loading.min.svg"
        data-src="https://img-blog.csdnimg.cn/4192402992cc4f7294516943d696b1a4.png"
        data-srcset="https://img-blog.csdnimg.cn/4192402992cc4f7294516943d696b1a4.png, https://img-blog.csdnimg.cn/4192402992cc4f7294516943d696b1a4.png 1.5x, https://img-blog.csdnimg.cn/4192402992cc4f7294516943d696b1a4.png 2x"
        data-sizes="auto"
        alt="https://img-blog.csdnimg.cn/4192402992cc4f7294516943d696b1a4.png"
        title="leetcode每日一题——地图中的最高点" /></a>
        </div><h2 class="single-title" itemprop="name headline">
        <a href="/posts/leetcode%E6%AF%8F%E6%97%A5%E4%B8%80%E9%A2%98%E5%9C%B0%E5%9B%BE%E4%B8%AD%E7%9A%84%E6%9C%80%E9%AB%98%E7%82%B9/">leetcode每日一题——地图中的最高点</a>
    </h2><div class="post-meta"><span class="post-author"><a href="/" title="Author" rel=" author" class="author"><i class="fas fa-user-circle fa-fw"></i>作者</a></span>&nbsp;<span class="post-publish">发布于 <time datetime="2022-01-29">2022-01-29</time></span>&nbsp;<span class="post-category">包括在 <a href="/categories/%E7%AE%97%E6%B3%95%E8%B7%AF%E5%BE%84%E6%9B%B4%E6%96%B0%E9%97%AE%E9%A2%98/"><i class="far fa-folder fa-fw"></i>算法——路径更新问题</a></span></div><a class="content" href="/posts/leetcode%E6%AF%8F%E6%97%A5%E4%B8%80%E9%A2%98%E5%9C%B0%E5%9B%BE%E4%B8%AD%E7%9A%84%E6%9C%80%E9%AB%98%E7%82%B9/">题目 题目链接 解题思路 两种解题思路，都是根据题目的意思更新路径信息即可： bfs思路：由于相邻的两个格子必须高度差为1，而水域必须高度为0，所以</a><div class="post-footer"><ul class="post-tags"><li><a href="/tags/leetcode%E6%AF%8F%E6%97%A5%E4%B8%80%E9%A2%98%E5%9C%B0%E5%9B%BE%E4%B8%AD%E7%9A%84%E6%9C%80%E9%AB%98%E7%82%B9/">leetcode每日一题——地图中的最高点</a></li></ul></div>
</article>
<article class="summary" itemscope itemtype="http://schema.org/Article" ><div class="featured-image-preview">
            <a href="/posts/leetcode%E6%AF%8F%E6%97%A5%E4%B8%80%E9%A2%98-%E6%B8%B8%E6%88%8F%E4%B8%AD%E5%BC%B1%E8%A7%92%E8%89%B2%E7%9A%84%E6%95%B0%E9%87%8F/"><img
        class="lazyload"
        src="/svg/loading.min.svg"
        data-src="https://s4.ax1x.com/2022/01/26/7L4VE9.png"
        data-srcset="https://s4.ax1x.com/2022/01/26/7L4VE9.png, https://s4.ax1x.com/2022/01/26/7L4VE9.png 1.5x, https://s4.ax1x.com/2022/01/26/7L4VE9.png 2x"
        data-sizes="auto"
        alt="https://s4.ax1x.com/2022/01/26/7L4VE9.png"
        title="leetcode每日一题-游戏中弱角色的数量" /></a>
        </div><h2 class="single-title" itemprop="name headline">
        <a href="/posts/leetcode%E6%AF%8F%E6%97%A5%E4%B8%80%E9%A2%98-%E6%B8%B8%E6%88%8F%E4%B8%AD%E5%BC%B1%E8%A7%92%E8%89%B2%E7%9A%84%E6%95%B0%E9%87%8F/">leetcode每日一题-游戏中弱角色的数量</a>
    </h2><div class="post-meta"><span class="post-author"><a href="/" title="Author" rel=" author" class="author"><i class="fas fa-user-circle fa-fw"></i>作者</a></span>&nbsp;<span class="post-publish">发布于 <time datetime="2022-01-28">2022-01-28</time></span>&nbsp;<span class="post-category">包括在 <a href="/categories/%E7%AE%97%E6%B3%95%E8%B4%AA%E5%BF%83/"><i class="far fa-folder fa-fw"></i>算法——贪心</a></span></div><a class="content" href="/posts/leetcode%E6%AF%8F%E6%97%A5%E4%B8%80%E9%A2%98-%E6%B8%B8%E6%88%8F%E4%B8%AD%E5%BC%B1%E8%A7%92%E8%89%B2%E7%9A%84%E6%95%B0%E9%87%8F/">题目 题目链接 解题思路 一句话解决：以第一个字段为标准从大到小排序，然后再遍历数组，对比第二字段的最大值即可。 关键细节： 为了避免第一个字段相同的</a><div class="post-footer"><ul class="post-tags"><li><a href="/tags/%E5%88%A9%E7%94%A8%E6%8E%92%E5%BA%8F%E5%9F%BA%E4%BA%8E%E9%81%8D%E5%8E%86%E8%BF%87%E7%A8%8B%E5%A4%84%E7%90%86%E7%9A%84%E8%B4%AA%E5%BF%83-%E6%B8%B8%E6%88%8F%E4%B8%AD%E5%BC%B1%E8%A7%92%E8%89%B2%E7%9A%84%E6%95%B0%E9%87%8F/">利用排序基于遍历过程处理的贪心-游戏中弱角色的数量</a></li></ul></div>
</article>
<article class="summary" itemscope itemtype="http://schema.org/Article" ><div class="featured-image-preview">
            <a href="/posts/leetcode%E6%AF%8F%E6%97%A5%E4%B8%80%E9%A2%98-%E6%A3%80%E6%B5%8B%E6%AD%A3%E6%96%B9%E5%BD%A2/"><img
        class="lazyload"
        src="/svg/loading.min.svg"
        data-src="https://img-blog.csdnimg.cn/img_convert/c2804a2e21ea79a0b060126b82a9145c.png#pic_center"
        data-srcset="https://img-blog.csdnimg.cn/img_convert/c2804a2e21ea79a0b060126b82a9145c.png#pic_center, https://img-blog.csdnimg.cn/img_convert/c2804a2e21ea79a0b060126b82a9145c.png#pic_center 1.5x, https://img-blog.csdnimg.cn/img_convert/c2804a2e21ea79a0b060126b82a9145c.png#pic_center 2x"
        data-sizes="auto"
        alt="https://img-blog.csdnimg.cn/img_convert/c2804a2e21ea79a0b060126b82a9145c.png#pic_center"
        title="leetcode每日一题-检测正方形" /></a>
        </div><h2 class="single-title" itemprop="name headline">
        <a href="/posts/leetcode%E6%AF%8F%E6%97%A5%E4%B8%80%E9%A2%98-%E6%A3%80%E6%B5%8B%E6%AD%A3%E6%96%B9%E5%BD%A2/">leetcode每日一题-检测正方形</a>
    </h2><div class="post-meta"><span class="post-author"><a href="/" title="Author" rel=" author" class="author"><i class="fas fa-user-circle fa-fw"></i>作者</a></span>&nbsp;<span class="post-publish">发布于 <time datetime="2022-01-27">2022-01-27</time></span>&nbsp;<span class="post-category">包括在 <a href="/categories/%E7%AE%97%E6%B3%95%E8%AE%A1%E7%AE%97%E5%87%A0%E4%BD%95/"><i class="far fa-folder fa-fw"></i>算法——计算几何</a></span></div><a class="content" href="/posts/leetcode%E6%AF%8F%E6%97%A5%E4%B8%80%E9%A2%98-%E6%A3%80%E6%B5%8B%E6%AD%A3%E6%96%B9%E5%BD%A2/">题目 题目链接 题目解析 注意此题为计算几何类型的题目，我认为这类问题最重要的就是把这个几何图形用好用的方法去表示出来。 三个重点： 点的表示：我们通</a><div class="post-footer"><ul class="post-tags"><li><a href="/tags/leetcode%E6%AF%8F%E6%97%A5%E4%B8%80%E9%A2%98-%E6%A3%80%E6%B5%8B%E6%AD%A3%E6%96%B9%E5%BD%A2/">leetcode每日一题-检测正方形</a></li></ul></div>
</article>
<article class="summary" itemscope itemtype="http://schema.org/Article" ><div class="featured-image-preview">
            <a href="/posts/java%E7%BD%91%E7%BB%9C%E7%BC%96%E7%A8%8B/"><img
        class="lazyload"
        src="/svg/loading.min.svg"
        data-src="https://s4.ax1x.com/2022/01/22/7hWvAH.png"
        data-srcset="https://s4.ax1x.com/2022/01/22/7hWvAH.png, https://s4.ax1x.com/2022/01/22/7hWvAH.png 1.5x, https://s4.ax1x.com/2022/01/22/7hWvAH.png 2x"
        data-sizes="auto"
        alt="https://s4.ax1x.com/2022/01/22/7hWvAH.png"
        title="Java网络编程" /></a>
        </div><h2 class="single-title" itemprop="name headline">
        <a href="/posts/java%E7%BD%91%E7%BB%9C%E7%BC%96%E7%A8%8B/">Java网络编程</a>
    </h2><div class="post-meta"><span class="post-author"><a href="/" title="Author" rel=" author" class="author"><i class="fas fa-user-circle fa-fw"></i>作者</a></span>&nbsp;<span class="post-publish">发布于 <time datetime="2022-01-26">2022-01-26</time></span>&nbsp;<span class="post-category">包括在 <a href="/categories/javaweb%E7%AC%94%E8%AE%B0/"><i class="far fa-folder fa-fw"></i>JavaWeb笔记</a></span></div><a class="content" href="/posts/java%E7%BD%91%E7%BB%9C%E7%BC%96%E7%A8%8B/">Java网络编程 配套视频 在JavaSE阶段，我们学习了I/O流，既然I/O流如此强大，那么能否跨越不同的主机进行I/O操作呢？这就要提到Ja</a><div class="post-footer"><ul class="post-tags"><li><a href="/tags/javaweb%E7%AC%AC%E4%B8%80%E8%8A%82/">JavaWeb第一节</a></li></ul></div>
</article>
<article class="summary" itemscope itemtype="http://schema.org/Article" ><div class="featured-image-preview">
            <a href="/posts/tcp%E7%BD%91%E7%BB%9C%E7%BC%96%E7%A8%8B%E4%B8%ADconnectlistenaccept%E4%B8%89%E8%80%85%E4%B9%8B%E9%97%B4%E7%9A%84%E5%85%B3%E7%B3%BB/"><img
        class="lazyload"
        src="/svg/loading.min.svg"
        data-src="https://s4.ax1x.com/2022/01/22/7hhFR1.png"
        data-srcset="https://s4.ax1x.com/2022/01/22/7hhFR1.png, https://s4.ax1x.com/2022/01/22/7hhFR1.png 1.5x, https://s4.ax1x.com/2022/01/22/7hhFR1.png 2x"
        data-sizes="auto"
        alt="https://s4.ax1x.com/2022/01/22/7hhFR1.png"
        title="TCP网络编程中connect、listen、accept三者之间的关系" /></a>
        </div><h2 class="single-title" itemprop="name headline">
        <a href="/posts/tcp%E7%BD%91%E7%BB%9C%E7%BC%96%E7%A8%8B%E4%B8%ADconnectlistenaccept%E4%B8%89%E8%80%85%E4%B9%8B%E9%97%B4%E7%9A%84%E5%85%B3%E7%B3%BB/">TCP网络编程中connect、listen、accept三者之间的关系</a>
    </h2><div class="post-meta"><span class="post-author"><a href="/" title="Author" rel=" author" class="author"><i class="fas fa-user-circle fa-fw"></i>作者</a></span>&nbsp;<span class="post-publish">发布于 <time datetime="2022-01-26">2022-01-26</time></span>&nbsp;<span class="post-category">包括在 <a href="/categories/linux%E7%BD%91%E7%BB%9C%E7%BC%96%E7%A8%8B/"><i class="far fa-folder fa-fw"></i>Linux网络编程</a></span></div><a class="content" href="/posts/tcp%E7%BD%91%E7%BB%9C%E7%BC%96%E7%A8%8B%E4%B8%ADconnectlistenaccept%E4%B8%89%E8%80%85%E4%B9%8B%E9%97%B4%E7%9A%84%E5%85%B3%E7%B3%BB/">基于 TCP 的网络编程开发分为服务器端和客户端两部分，常见的核心步骤和流程如下： 整个函数调用(image)" 整个函数调用(image) accept</a><div class="post-footer"><ul class="post-tags"><li><a href="/tags/tcp%E7%BD%91%E7%BB%9C%E7%BC%96%E7%A8%8B%E4%B8%ADconnectlistenaccept%E4%B8%89%E8%80%85%E4%B9%8B%E9%97%B4%E7%9A%84%E5%85%B3%E7%B3%BB/">TCP网络编程中connect、listen、accept三者之间的关系</a></li></ul></div>
</article>
<ul class="pagination"><li class="page-item ">
                    <span class="page-link">
                        <a href="/">1</a>
                    </span>
                </li><li class="page-item ">
                    <span class="page-link" aria-hidden="true">&hellip;</span>
                </li><li class="page-item ">
                    <span class="page-link">
                        <a href="/page/4/">4</a>
                    </span>
                </li><li class="page-item ">
                    <span class="page-link">
                        <a href="/page/5/">5</a>
                    </span>
                </li><li class="page-item active">
                    <span class="page-link">
                        <a href="/page/6/">6</a>
                    </span>
                </li><li class="page-item ">
                    <span class="page-link">
                        <a href="/page/7/">7</a>
                    </span>
                </li></ul></div></div></div>
            </main>
            <footer class="footer"><div class="footer-container"><div class="footer-line">由 <a href="https://gohugo.io/" target="_blank" rel="noopener noreffer" title="Hugo 0.86.0">Hugo</a> 强力驱动 | 主题 - <a href="https://github.com/khusika/FeelIt" target="_blank" rel="noopener noreffer" title="FeelIt 1.0.1"><i class="fas fa-hand-holding-heart fa-fw"></i> FeelIt</a>
        </div><div class="footer-line" itemscope itemtype="http://schema.org/CreativeWork"><i class="far fa-copyright fa-fw"></i><span itemprop="copyrightYear">2023</span><span class="author" itemprop="copyrightHolder">&nbsp;<a href="/"></a></span></div>
</div>
</footer>
        </div>

        <div id="fixed-buttons"><a href="#" id="back-to-top" class="fixed-button" title="回到顶部">
                <i class="fas fa-chevron-up fa-fw"></i>
            </a></div><link rel="stylesheet" href="/lib/fontawesome-free/all.min.css"><link rel="stylesheet" href="/lib/animate/animate.min.css"><script src="/lib/autocomplete/autocomplete.min.js"></script><script src="/lib/lunr/lunr.min.js"></script><script src="/lib/lunr/lunr.stemmer.support.min.js"></script><script src="/lib/lunr/lunr.zh.min.js"></script><script src="/lib/lazysizes/lazysizes.min.js"></script><script src="/lib/typeit/typeit.min.js"></script><script>window.config={"code":{"maxShownLines":200},"data":{"id-1":"\u003cdiv style='color: rgb(153, 153, 153)'\u003e独属于 \u003ca href='https://blog.csdn.net/m0_50945504' target='_blank'\u003eL_B__\u003c/a\u003e 的笔记小站\u003c/div\u003e"},"search":{"highlightTag":"em","lunrIndexURL":"/index.json","lunrLanguageCode":"zh","lunrSegmentitURL":"/lib/lunr/lunr.segmentit.js","maxResultLength":100,"noResultsFound":"没有找到结果","snippetLength":50,"type":"lunr"},"typeit":{"cursorChar":null,"cursorSpeed":null,"data":{"id-1":["id-1"]},"duration":null,"speed":null}};</script><script src="/js/theme.min.js"></script></body></html>
